"""
Snail

Snail creeps up the vertical pole of height H feets. Per day it goes A feets up, and per night it goes B feets down. In which day the snail will reach the top of the pole?

Input data format

On the input the program receives non-negative integers H, A, B, where H > B and A > B. Every integer does not exceed 100.

蜗牛

蜗牛爬到高度为H英尺的垂直杆上。 每天，它上升A英尺，每晚，它下降B英尺。 哪一天蜗牛会到达极点？

输入数据格式

程序在输入时接收非负整数H，A，B，其中H> B和A>B。每个整数不超过100。
"""

# h, a, b = int(input()), int(input()), int(input())
# if 100 >= h > b >= 0 and 100 >= a > b >= 0:
#     h1 = day = 0
#     while True:
#         day += 1
#         h1 += a
#         if h1 >= h:
#             print(day)
#             break
#         else:
#             h1 -= b
from math import ceil

H, A, B = int(input()), int(input()), int(input())
d = A - B
print(ceil((H - A) / d + 1))
